A Lumped-state Model of Clustering in Dynamic Storage Allocation
نویسندگان
چکیده
منابع مشابه
A Stochastic Model of Fragmentation in Dynamic Storage Allocation
We study a model of dynamic storage allocation in which requests for single units of memory arrive in a Poisson stream at rate A and are accommodated by the first available location found in a linear scan of memory. Immediately after this first-fit assignment, an occupied location commences an exponential delay with rate parameter/z, after which the location again becomes available. The set of ...
متن کاملGeneralized Dynamic Storage Allocation
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time restrictions. Approximate algorithms have been constructed through online coloring of interval graphs. We present a generalization that uses online coloring of tolerance graphs. We utilize online-with-representation algorithms on tolerance graphs, which are online algorithms in which the correspo...
متن کاملScalability of Dynamic Storage Allocation Algorithms
Dynamic storage allocation has a signi cant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage e ciently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the abili...
متن کاملAn Analysis the Effect of Capital Taxation on Allocation of Resources: A Dynamic Equilibrium Model Approach
Abstract T he return of capital is fundamental to the intertemporal allocation of resources by changing the consumption behavior and capital accumulation over time. Taxation on return of capital increases the marginal product of capital, meaning that capital stock is lower than when capital is not taxed, which results decreased growth and welfare in steady state. This pape...
متن کاملOptimum Storage Allocation for a File in Steady State
A file of fixed-length records in auxiliary storage using a key-to-address transformation to assign records to addresses is considered. The file is assumed to be in steady state, that is that the rates of additions to and of deletions from the file are equal. The loading factors that minimize file maintenance costs in terms of storage space and additional accesses are computed for different buc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1984
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/27.2.135